- perfect hash-function
- совершенная хэш-функция, совершенная функция расстановки ключей
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
perfect hash-function
Смотреть что такое "perfect hash-function" в других словарях:
Perfect hash function — A perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions. A perfect hash function has many of the same applications as other hash functions, but with the advantage that no… … Wikipedia
Hash function — A hash function is any well defined procedure or mathematical function for turning some kind of data into a relatively small integer, that may serve as an index into an array. The values returned by a hash function are called hash values, hash… … Wikipedia
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
Hash collision — In computer science, a hash collision or hash clash is a situation that occurs when two distinct inputs into a hash function produce identical outputs.All hash functions have potential collisions, though with a well designed hash function,… … Wikipedia
Dynamic perfect hashing — In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure.[1][2][3] This technique is useful for situations where fast queries, insertions, and deletions must be made on a… … Wikipedia
Bent function — The 2 ary bent functions with Hamming weight 1 Their nonlinearity is … Wikipedia
Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… … Wikipedia
Lamport signature — In cryptography, a Lamport signature or Lamport one time signature scheme is a method for constructing a digital signature. Lamport signatures can be built from any cryptographically secure one way function; usually a cryptographic hash function… … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is … Wikipedia
Pearson hashing — Fast Hashing of Variable Length Text Strings . Peter K. Pearson, Communications of the ACM 33(6), 677 (1990) mdash; [http://portal.acm.org/citation.cfm?id=78978 ACM full text (requires subscription)] ] is a hash function designed for fast… … Wikipedia
